Set cover problem - PDFSEARCH.IO - Document Search Engine

Set cover problem
Results: 76

#	Item
41	A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:58:37 NP-complete problems Combinatorics Analysis of algorithms Set packing Randomized algorithm Disjoint-set data structure Parameterized complexity Set cover problem Dominating set Theoretical computer science Computational complexity theory Mathematics
42	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Geometric Red-Blue Set Cover for Unit Squares and Related Problems Timothy M. Chan∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Vertex cover Set cover problem Monotone polygon NP-complete problems Mathematics Applied mathematics
43	ICS 260 – Fall 2001 – Final Exam Name: Answer Key Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:39 NP-complete problems Travelling salesman problem Independent set NP-complete Set cover problem NP Directed acyclic graph Kernelization Vertex cover Theoretical computer science Computational complexity theory Mathematics
44	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 NP-complete problems Vertex cover Reduction Ordinal number Parameterized complexity Cardinality APX Set cover problem Polygonal chain Theoretical computer science Computational complexity theory Mathematics
45	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics
46	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
47	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems
48	Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:16:31 NP-complete problems Parameterized complexity Kernelization Dominating set Vertex cover Path decomposition Planar separator theorem Clique problem Graph coloring Theoretical computer science Graph theory Mathematics
49	CCCG 2011, Toronto ON, August 10–12, 2011 Enumerating Minimal Transversals of Geometric Hypergraphs Khaled Elbassioni∗ Imran Rauf† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:15 NP-complete problems Algorithm Set cover problem Polynomial Vertex cover Matroid Mathematics Hypergraph Applied mathematics
50	CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:50 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory

UPDATE